A Simple SVD Algorithm for Finding Hidden Partitions
نویسندگان
چکیده
منابع مشابه
A Simple SVD Algorithm for Finding Hidden Partitions
Finding a hidden partition in a random environment is a general and important problem, which contains as subproblems many important questions, such as finding a hidden clique, finding a hidden coloring, finding a hidden bipartition etc. In this paper, we provide a simple SVD algorithm for this purpose, answering a question of McSherry. This algorithm is easy to implement and works for sparse gr...
متن کاملA Simple Spectral Algorithm for Recovering Planted Partitions
In this paper, we consider the planted partition model, in which n = ks vertices of a random graph are partitioned into k “clusters,” each of size s. Edges between vertices in the same cluster and different clusters are included with constant probability p and q, respectively (where 0 ≤ q < p ≤ 1). We give an efficient algorithm that, with high probability, recovers the clustering as long as th...
متن کاملFinding Balanced Graph Bi-Partitions Using a Hybrid Genetic Algorithm
In th is pap er w e prop ose a hybrid g en etic a lgo rith m for th e graph b alanced b i-p a rtition prob lem , a chal len g in g N P -h ard com b in atoria l o p tim iza tio n prob lem aris ing in m any p ractica l ap p lica tion s. T h e hybrid character o f th e G A lies in th e ap p lica tion o f a h eu ristic p rocedu re to im prove can d id ate so lu tion s. T h e b asic idea b eh in ...
متن کاملAN ALGORITHM FOR FINDING THE EIGENPAIRS OF A SYMMETRIC MATRIX
The purpose of this paper is to show that ideas and techniques of the homotopy continuation method can be used to find the complete set of eigenpairs of a symmetric matrix. The homotopy defined by Chow, Mallet- Paret and York [I] may be used to solve this problem with 2""-n curves diverging to infinity which for large n causes a great inefficiency. M. Chu 121 introduced a homotopy equation...
متن کاملA Simple Algorithm for Finding All k-Edge-Connected Components
The problem of finding k-edge-connected components is a fundamental problem in computer science. Given a graph G = (V, E), the problem is to partition the vertex set V into {V1, V2,…, Vh}, where each Vi is maximized, such that for any two vertices x and y in Vi, there are k edge-disjoint paths connecting them. In this paper, we present an algorithm to solve this problem for all k. The algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2017
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548317000463